منابع مشابه
Mixed languages
Let T =A∪B ∪C be an alphabet that is partitioned into three subalphabets. Themixing product of a word g over A ∪B and of a word d over A ∪C is the set of words w over T such that its projection onto A ∪ B gives g and its projection onto A ∪ C gives d. Let R be a regular language over T such that xbcy is in R if and only if xcby is in R for any two letters b in B and c in C. In other words, R is...
متن کاملSentiment Analysis of Code-Mixed Languages leveraging Resource Rich Languages
Code-mixed data is an important challenge of natural language processing because its characteristics completely vary from the traditional structures of standard languages. In this paper, we propose a novel approach called Sentiment Analysis of Code-Mixed Text (SACMT) to classify sentences into their corresponding sentiment positive, negative or neutral, using contrastive learning. We utilize th...
متن کاملCompositionality Criteria for Defining Mixed-Styles Synchronous Languages
This is not a paper about compositionality in itself, nor a general paper about mixing synchronous languages. We rst recall that compositionality appears in three places in the deenition of synchronous languages : 1) the synchrony hypothesis guarantees that the formal semantics of the language is compositional (in the sense that there exists an appropriate congruence) ; 2) programming environme...
متن کاملCode Mixed Entity Extraction in Indian Languages using Neural Networks
In this paper we present our submission for FIRE 2016 Shared Task on Code Mixed Entity Extraction in Indian Languages. We describe a Neural Network system for Entity Extraction in Hindi-English Code Mixed text. Our method uses distributed word representations as features for the Neural Network and therefore, can easily be replicated across languages. Our system ranked first place for Hindi-Engl...
متن کاملQuantum automata with mixed states; functions and languages recognition
In this work we consider the aspect of computational complexity called oracle query complexity, that is number of queries one needs to ask oracle to compute Boolean function We show two computational models: pure states quantum automata and quantum automata with mixed states. We present a function, that can be computed by quantum automata with mixed states with fewer queries than by pure states...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.08.016